/*
 * Project: Data Mining using SWARM
 * File: test_OG.cpp
 * Author: Ivan Schwarz
 * Description: Running test example from Swarm paper
 */

#include "BTree.h"

using namespace std;

/*
int main() 
{
	int oSet[] = {0,1,2,3};
	vector<int> oData(oSet, oSet + sizeof(oSet) / sizeof(int) );
	vector<int> * oData_p = &oData; 

	int tSet[] = {0,1,2,3};
	vector<int> tData(tSet, tSet + sizeof(tSet) / sizeof(int) );
	vector<int> * tData_p = &tData; 

	int t0_c0d [] = {2};
	int t0_c1d [] = {0,1,3};

	int t1_c0d [] = {0,2};
	int t1_c1d [] = {0,1,3};

	int t2_c0d [] = {0};
	int t2_c1d [] = {1,2,3};

	int t3_c0d [] = {0,1,3};
	int t3_c1d [] = {2};

	vector<int> t0_c0(t0_c0d, t0_c0d + sizeof(t0_c0d) / sizeof(int) );
	vector<int> t0_c1(t0_c1d, t0_c1d + sizeof(t0_c1d) / sizeof(int) );
	vector<int> t1_c0(t1_c0d, t1_c0d + sizeof(t1_c0d) / sizeof(int) );
	vector<int> t1_c1(t1_c1d, t1_c1d + sizeof(t1_c1d) / sizeof(int) );
	vector<int> t2_c0(t2_c0d, t2_c0d + sizeof(t2_c0d) / sizeof(int) );
	vector<int> t2_c1(t2_c1d, t2_c1d + sizeof(t2_c1d) / sizeof(int) );
	vector<int> t3_c0(t3_c0d, t3_c0d + sizeof(t3_c0d) / sizeof(int) );
	vector<int> t3_c1(t3_c1d, t3_c1d + sizeof(t3_c1d) / sizeof(int) );

	vector<vector<int>> t0_c;
	t0_c.push_back(t0_c0);
	t0_c.push_back(t0_c1);

	vector<vector<int>> t1_c;
	t1_c.push_back(t1_c0);
	t1_c.push_back(t1_c1);

	vector<vector<int>> t2_c;
	t2_c.push_back(t2_c0);
	t2_c.push_back(t2_c1);

	vector<vector<int>> t3_c;
	t3_c.push_back(t3_c0);
	t3_c.push_back(t3_c1);

	vector<vector<vector<int>>> cData;
	cData.push_back(t0_c);
	cData.push_back(t1_c);
	cData.push_back(t2_c);
	cData.push_back(t3_c);

	vector<vector<vector<int>>> * cData_p = &cData; 

	int mino = 2;
	int mint = 2;
	BTreeNode * testTree = new BTreeNode(oData_p,tData_p,cData_p);
	testTree->objectGrowth(mino,mint);
	delete testTree;

	std::getchar();
	return 0;

}*/
